Dirichlet series of integers with missing digits

نویسندگان

چکیده

For certain sequences A of positive integers with missing g-adic digits, the Dirichlet series FA(s)=∑a∈Aa−s has abscissa convergence σc<1. The number σc is computed. This generalizes and strengthens a classical theorem Kempner on sum reciprocals sequence decimal digits.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Binary Representations of Integers with Digits

Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized by separating nonzero digits by at least one zero. We find an explicit formula that produces the digits of the expansion of an integer n which leads us to many generalized situations. Syntactical properties of such representations are also discussed. 1. A binary number system Integers n can be wri...

متن کامل

Approximate Polynomial GCD over Integers with Digits-wise Lattice

For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...

متن کامل

Analytical D’Alembert Series Solution for Multi-Layered One-Dimensional Elastic Wave Propagation with the Use of General Dirichlet Series

A general initial-boundary value problem of one-dimensional transient wave propagation in a multi-layered elastic medium due to arbitrary boundary or interface excitations (either prescribed tractions or displacements) is considered. Laplace transformation technique is utilised and the Laplace transform inversion is facilitated via an unconventional method, where the expansion of complex-valued...

متن کامل

On the Sum of Digits of Some Sequences of Integers

Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {an}n=1 that for most n the sum of the digits of an in base b is at least cb log n, where cb is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.

متن کامل

Dirichlet Series

This definition could have been given to an 18th or early 19th century mathematical audience, but it would not have been very popular: probably they would not have been comfortable with the Humpty Dumpty-esque redefinition of multiplication. Mathematics at that time did have commutative rings: rings of numbers, of matrices, of functions, but not rings with a “funny” multiplication operation def...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2021

ISSN: ['0022-314X', '1096-1658']

DOI: https://doi.org/10.1016/j.jnt.2020.10.002